package LeetCode._01_树;

public class _100_相同的树 {
    public class TreeNode {
        int val;
       TreeNode left;
       TreeNode right;
        TreeNode() {}
        TreeNode(int val) { this.val = val; }
        TreeNode(int val,TreeNode left,TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    //函数定义:输入两个节点，判断这两个节点为根的树是否相同
    public boolean isSameTree(TreeNode p, TreeNode q) {
       if(p == null && q == null) return true;
       if(p == null || q == null) return false;
       if(p.val!=q.val) return false;

       return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
    }


}
